Birth of a Strongly Connected Giant in an Inhomogeneous Random Digraph
نویسندگان
چکیده
We present and investigate a general model for inhomogeneous random digraphs with labeled vertices, where the arcs are generated independently, and the probability of inserting an arc depends on the labels of its endpoints and its orientation. For this model the critical point for the emergence of a giant component is determined via a branching process approach. key words: inhomogeneous digraph, phase transition, giant component. 2010 Mathematics Subject Classification 05C82, 90B15, 60C05
منابع مشابه
The graph structure of a deterministic automaton chosen at random: full version
A deterministic finite automaton (dfa) of n states over a k-letter alphabet can be seen as a digraph with n vertices which all have exactly k labeled out-arcs (k-out digraph). In 1973 Grusho [16] first proved that with high probability (whp) in a random k-out digraph there is a strongly connected component (scc) of linear size that is reachable from all vertices, i.e., a giant. He also proved t...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملThe Investigation of Giant Magneto Resistance in an Inhomogeneous Ladder Lattice
Abstract : The variation of the electrical resistivity of a material in the externalmagnetic field is known as magneto resistance. This phenomenon has been attractedboth theoretical and experimental researchers in miniaturization of magneto meters inthe recent years. In this paper, the magneto resistance of an inhomogeneous twodimensional conductor with ladder geometry i...
متن کاملLinear Sphericity Testing of 3-Connected Single Source Digraphs
It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3-connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $O(n)$ time.
متن کاملSufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Probability
دوره 49 شماره
صفحات -
تاریخ انتشار 2012